Evolution of Cooperation for Multiple Mutant Configurations on All Regular Graphs with N ≤ 14 Players

Evolution of cooperation on dynamical graphs

There are two key characteristic of animal and human societies: (1) degree heterogeneity, meaning that not all individual have the same number of associates; and (2) the interaction topology is not static, i.e. either individuals interact with different set of individuals at different times of their life, or at least they have different associations than their parents. Earlier works have shown ...

Evolution of multiplayer cooperation on graphs

There has been much interest in studying evolutionary games in structured populations, often modelled as graphs. However, most analytical results so far have only been obtained for two-player or additive games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games in regular graphs updated with a Mo...

Self-dual Configurations and Regular Graphs

On regular configurations and disjoint cycles in shift graphs

Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are discussed, including construction, uniqueness, symmetry group and the link with balanced words. Another model of configurations is the polygons formed by a given ...

Connected (n 4 ) Configurations Exist for Almost All N

An (n4) configuration is a family of n points and n (straight) lines in the Euclidean plane such that each point is on precisely four of the lines, and each line contains precisely four of the points. A configuration is said to be connected if it is possible to reach every point starting from an arbitrary point and stepping to other points only if they are on one of the lines of the configurati...